Computing rank-width exactly
نویسندگان
چکیده
منابع مشابه
Computing rank-width exactly
We prove that the rank-width of an n-vertex graph can be computed exactly in time O(2n log n log log n). To improve over a trivial O(3 log n)-time algorithm, we develop a general framework for decompositions on which an optimal decomposition can be computed efficiently. This framework may be used for other width parameters, including the branch-width of matroids and the carving-width of graphs....
متن کاملComputing hypergraph width measures exactly
Hypergraph width measures are a class of hypergraph invariants important in studying the complexity of constraint satisfaction problems (CSPs). We present a general exact exponential algorithm for a large variety of these measures. A connection between these and tree decompositions is established. This enables us to almost seamlessly adapt the combinatorial and algorithmic results known for tre...
متن کاملRank-width of random graphs
Rank-width of a graph G, denoted by rw(G), is a width parameter of graphs introduced by Oum and Seymour (2006). We investigate the asymptotic behavior of rank-width of a random graph G(n, p). We show that, asymptotically almost surely, (i) if p ∈ (0, 1) is a constant, then rw(G(n, p)) = dn3 e −O(1), (ii) if 1 n p ≤ 1 2 , then rw(G(n, p)) = d n 3 e − o(n), (iii) if p = c/n and c > 1, then rw(G(n...
متن کاملGraphs of Bounded Rank-width
We define rank-width of graphs to investigate clique-width. Rank-width is a complexity measure of decomposing a graph in a kind of tree-structure, called a rankdecomposition. We show that graphs have bounded rank-width if and only if they have bounded clique-width. It is unknown how to recognize graphs of clique-width at most k for fixed k > 3 in polynomial time. However, we find an algorithm r...
متن کاملRank-width and vertex-minors
The rank-width is a graph parameter related in terms of fixed functions to cliquewidth but more tractable. Clique-width has nice algorithmic properties, but no good “minor” relation is known analogous to graph minor embedding for tree-width. In this paper, we discuss the vertex-minor relation of graphs and its connection with rank-width. We prove a relationship between vertex-minors of bipartit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2009
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2009.03.018